Clique cover - PDFSEARCH.IO - Document Search Engine

Clique cover
Results: 36

#	Item
1	CS264: Homework #5 Due by midnight on Wednesday, October 29, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-10-27 18:59:34 Graph theory NP-complete problems Clique Clique cover Graph coloring
2	Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2014-09-25 06:28:22 Graph theory Mathematics NP-complete problems Combinatorial optimization Graph connectivity Graph coloring Graph Matching Triadic closure Clique problem Vertex cover Clique
3	Microsoft Wordtext.nativedoc Add to Reading List Source URL: web.uvic.ca Language: English - Date: 2012-11-03 03:43:42 Graph theory Computational complexity theory Mathematics NP-complete problems Vertex cover Clique Degree Connectivity Independent set Graph coloring
4	Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2016-01-12 16:30:06 Graph theory NP-complete problems Graph coloring Triangle-free graph Treewidth Independent set Planar graph Line graph Perfect graph Dominating set Clique cover Graph minor
5	Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind† Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2016-07-01 10:19:11 NP-complete problems Clique problem Vertex cover Clique Independent set Bipartite graph Travelling salesman problem Graph coloring Line graph Treewidth Pathwidth
6	Structural parameterizations for boxicity Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt Abstract The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dime Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-20 07:20:59 Boxicity Geometric graph theory Planar graphs Pathwidth Intersection graph Treewidth Chordal graph Clique Interval graph Outerplanar graph Vertex cover Graph coloring
7	Data Reduction, Exact, and Heuristic Algorithms for Clique Cover Jens Gramm Jiong Guo Add to Reading List Source URL: www.user.tu-berlin.de Language: English - Date: 2013-01-21 07:02:09
8	PDF Document Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-10-07 11:22:31 Graph theory NP-complete problems Graph connectivity Graph operations Graph coloring Degeneracy Tree Neighbourhood Clique K-edge-connected graph Vertex cover Degree
9	Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal\|gsat\|neeldhara}@csa.iisc.ernet.in Add to Reading List Source URL: drona.csa.iisc.ernet.in Language: English - Date: 2014-08-01 08:33:48 NP-complete problems Vertex cover Vertex Graph Hamiltonian path Tree Clique Neighbourhood Connectivity Graph theory Mathematics Theoretical computer science
10	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:07 NP-complete problems Clique problem Vertex cover Matching Eulerian path Clique Minimum spanning tree Randomized algorithm Connectivity Graph theory Theoretical computer science Mathematics

UPDATE